Geographic GReedy Routing with ACO Recovery Strategy GRACO
نویسندگان
چکیده
Geographic routing is an attractive routing strategy in wireless sensor networks. It works well in dense networks, but it may suffer from the void problem. For this purpose, a recovery step is required to guarantee packet delivery. Face routing has widely been used as a recovery strategy since proved to guarantee delivery. However, it relies on a planar graph not always achievable in realistic wireless networks and may generate long paths. In this paper, we propose GRACO, a new geographic routing algorithm that combines a greedy forwarding and a recovery strategy based on swarm intelligence. During recovery, ant packets search for alternative paths and drop pheromone trails to guide next packets within the network. GRACO avoids holes and produces near optimal paths. Simulation results demonstrate that GRACO leads to a significant improvement of routing performance and scalability when compared to the literature algorithms.
منابع مشابه
Greedy Routing Recovery Using Controlled Mobility in Wireless Sensor Networks
One of the most current routing families in wireless sensor networks is geographic routing. Using nodes location, they generally apply a greedy routing that makes a sensor forward data to route to one of its neighbors in the forwarding direction of the destination. If this greedy step fails, the routing protocol triggers a recovery mechanism. Such recovery mechanisms are mainly based on graph p...
متن کامل“Direction” Assisted Geographic Routing for Mobile Ad Hoc networks
— In Geographic Routing protocols (e.g. GPSR), a node makes packet forwarding decisions based on the coordinates of its neighbors and the packet’s destination. Geo-routing uses greedy forwarding as a default; if this fails (e.g. the packet is trapped in a dead end caused by holes and/or obstacles), a recovery scheme based on perimeter routing is invoked. This however often leads to degraded per...
متن کاملAdaptive Routing In Mobile Adhoc Networks And Comparison Between Routing Protocols Aodv And Dsr For Apu Strategy
The Adhoc networks becomes very popular everyone is using these networks because of which we need to maintain up-to-date positions of their immediate neighbors for making effective forwarding decisions. Periodic broadcasting of beacon packets that contain the geographic location coordinates of the nodes is a popular method used by most geographic routing protocols to maintain neighbor positions...
متن کاملJunction-Based Geographic Routing Algorithm for Vehicular Ad hoc Networks
Vehicular Ad Hoc Networks (VANETs) have attracted the interest of the scientific community, since many issues remain open, especially in the research area of routing techniques. In this work we propose a new position-based routing algorithm called Junction-Based Routing (or JBR). The algorithm makes use of selective greedy forwarding up to the node that is located at a junction and is closer to...
متن کاملPlanar graph routing on geographical clusters
Geographic routing protocols base their forwarding decisions on the location of the current device, its neighbors, and the packets destination. Early proposed heuristic greedy routing algorithms might fail even if there is a path from source to destination. In recent years several recovery strategies have been proposed in order to overcome such greedy routing failures. Planar graph traversal wa...
متن کامل